Novel verifiable multi-secret sharing scheme using bilinear pairing
نویسنده
چکیده
Secret sharing schemes as basic building blocks for many applications in distributed systems should be efficient and robust to any possible attacks. Based on bilinear pairing, this paper will propose a new (t, n) threshold verifiable multi-secret sharing scheme and a GGOC verifiable multi-secret sharing scheme that improve the security and minimizes the number of published values.
منابع مشابه
An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملLinear threshold verifiable secret sharing in bilinear groups
In many pairing-based cryptosystems, the secret keys are elements of bilinear groups. For safeguarding such secret keys or decrypting or signing in a threshold manner, Verifiable Secret Sharing (VSS) in bilinear groups is required. In this paper, we show a method of verifiably sharing a random secret in a bilinear group. Our method is simple and practical. It can be regarded as a generalisation...
متن کاملA Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme
A publicly verifiable secret sharing (PVSS) scheme, proposed by Stadler in [Sta96], is a VSS scheme in which anyone, not only the shareholders, can verify that the secret shares are correctly distributed. PVSS can play essential roles in the systems using VSS. Achieving simultaneously the following two features for PVSS is a challenging job: – Efficient non-interactive public verification. – Pr...
متن کاملPublicly Verifiable Secret Sharing Schemes Using Bilinear Pairings
A non-interactive, simple and efficient publicly verifiable secret sharing (PVSS) is constructed based on the bilinear pairing on elliptic curves, which has all advantages of Schoenmakers’ PVSS in [15]. Moreover, in the scheme’s distribution of shares phase, only using bilinearity of bilinear paring, anybody can verify that the participants received whether correct shares without implementing i...
متن کامل